3N-Q: Natural Nearest Neighbor with Quality
نویسندگان
چکیده
In this paper, a novel algorithm for enhancing the performance of classification is proposed. This new method provides rich information for clustering and outlier detection. We call it Natural Nearest Neighbor with Quality (3N-Q). Comparing to K-nearest neighbor and E-nearest neighbor, 3N-Q employs a completely different concept to find the nearest neighbors passively, which can adaptively and automatically get the K value. This value as well as distribution of neighbors and frequency of being neighbors of others offer precious foundation not only in classification but also in clustering and outlier detection. Subsequently, we propose a fitness function that reflects the quality of each training sample, retaining the good ones while eliminating the bad ones according to the quality threshold. From the experiment results we report in this paper, it is observed that 3N-Q is efficient and accurate for solving data mining problems.
منابع مشابه
Evaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests
Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...
متن کاملEvaluation Accuracy of Nearest Neighbor Sampling Method in Zagross Forests
Collection of appropriate qualitative and quantitative data is necessary for proper management and planning. Used the suitable inventory methods is necessary and accuracy of sampling methods dependent the inventory net and number of sample point. Nearest neighbor sampling method is a one of distance methods and calculated by three equations (Byth and Riple, 1980; Cotam and Curtis, 1956 and Cota...
متن کاملApproximate Nearest Line Search in High Dimensions
We consider the Approximate Nearest Line Search (NLS) problem. Given a set L of N lines in the high dimensional Euclidean space R, the goal is to build a data structure that, given a query point q ∈ R, reports a line ` ∈ L such that its distance to the query is within (1+ ) factor of the distance of the closest line to the query point q. The problem is a natural generalization of the well-studi...
متن کاملNon-zero probability of nearest neighbor searching
Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...
متن کاملNearest Neighbors Problem
DEFINITION Given a set of n points and a query point, q, the nearest-neighbor problem is concerned with finding the point closest to the query point. Figure 1 shows an example of the nearest neighbor problem. On the left side is a set of n = 10 points in a two-dimensional space with a query point, q. The right shows the problem solution, s. Figure 1: An example of a nearest-neighbor problem dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer and Information Science
دوره 7 شماره
صفحات -
تاریخ انتشار 2014